-
1 permutation problem
Большой англо-русский и русско-английский словарь > permutation problem
-
2 permutation problem
Математика: задача о перестановках -
3 permutation problem
-
4 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
5 задача о перестановках
Большой англо-русский и русско-английский словарь > задача о перестановках
-
6 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph
См. также в других словарях:
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Permutation cipher — In classical cryptography, a permutation cipher is a transposition cipher in which the key is a permutation.To apply a cipher, a random permutation of size e is generated (the larger the value of e the more secure the cipher). The plaintext is… … Wikipedia
Permutation automaton — In automata theory, a permutation automaton, or pure group automaton, is a deterministic finite automaton such that each input symbol permutes the set of states.[1][2] Formally, a deterministic finite automaton A may be defined by the tuple (S, I … Wikipedia
Permutation — In mathematics, one of several ways of arranging or picking a set of items. The number of permutations possible for arranging a given a set of n numbers is equal to n factorial (n!). So, a set of three numbers can be arranged as: 3x2x1 = 6… … Investment dictionary
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Random permutation statistics — The statistics of random permutations, such as the cycle structure of a random permutation are of fundamental importance in the analysis of algorithms, especially of sorting algorithms, which operate on random permutations. Suppose, for example,… … Wikipedia
Mathematical chess problem — is a mathematical problem which is formulated using chessboard or chess pieces. These problems belong to recreational mathematics. The most known problems of this kind are Eight queens puzzle or Knight s Tour problems, which have connection to… … Wikipedia
Josephus-Permutation — Das Josephus Problem oder die Josephus Permutation ist ein theoretisches Problem aus der Informatik oder Mathematik. Es werden n nummerierte Objekte im Kreis angeordnet; dann wird beginnend mit der Nummer s, jedes s te Objekt entfernt, wobei der… … Deutsch Wikipedia
Josephus Permutation — Das Josephus Problem oder die Josephus Permutation ist ein theoretisches Problem aus der Informatik oder Mathematik. Es werden n nummerierte Objekte im Kreis angeordnet; dann wird beginnend mit der Nummer s, jedes s te Objekt entfernt, wobei der… … Deutsch Wikipedia
Josephus-Problem — Das Josephus Problem oder die Josephus Permutation ist ein theoretisches Problem aus der Informatik oder Mathematik. Es werden n nummerierte Objekte im Kreis angeordnet; dann wird beginnend mit der Nummer s, jedes s te Objekt entfernt, wobei der… … Deutsch Wikipedia
Josephus Problem — Das Josephus Problem oder die Josephus Permutation ist ein theoretisches Problem aus der Informatik oder Mathematik. Es werden n nummerierte Objekte im Kreis angeordnet; dann wird beginnend mit der Nummer s, jedes s te Objekt entfernt, wobei der… … Deutsch Wikipedia